Duality and Equivalencies in Closed Tandem Queueing Networks
نویسنده
چکیده
Equivalence relations between closed tandem queueing networks are established. Four types of models are under consideration: single-server infinite-capacity buffer queues, infinite-server queues with resequencing, single-server unit-capacity buffer queues with blocking before service, and single-server unit-capacity buffer queues with blocking after service. Using a customer/server duality we show that in a network consisting of single-server infinite-capacity-buffer queues, customer-dependent service times and server-dependent service times yield equivalent performance characteristics. We further show that for closed tandem queueing networks, a system consisting of single-server infinite-capacity-buffer queues (resp. infinite-server queues with resequencing) and a system consisting of single-serverunit-capacitybuffer queues with blocking before service (resp. blocking after service) have equivalent performance behaviors. As applications of these equivalence properties, we obtain new results on the analysis of symmetric closed tandem networks, where all the service times are independent and identically distributed random variables. In particular, we obtain a closed-form expression for the throughput of networks with unit-capacity-buffer queues and blocking before service when the service times are exponentially distributed. We also prove the monotonicity of throughput (of queues) with respect to the number of queues and number of customers in these models. This last property in turn implies the existence of nonzero asymptotic throughput when the number of queues and number of customers go to infinity.
منابع مشابه
Some Exact Results on Closed Queueing Networks with Blocking
We obtain equivalencies between closed queueing networks with blocking with respect to buffer capacities and the number of customers in the network. These results can be used in approximations, in the buffer allocation problem as well as to explain the behavior of closed queueing networks with finite buffers. We also present exact efficient solutions for special cases.
متن کاملProperties and Analysis of Queueing Network Models with Finite Capacities
A b s t r a c t Queueing network models with finite capacity queues and blocking are used to represent systems with finite capacity resources and with resource constraints, such as production, communication and computer systems. Various blocking mechanisms have been defined in literature to represent the various behaviours of real systems with limited resources. Queueing networks with finite ca...
متن کاملClosed-network duals of multiqueues with application to token-passing systems
Asymmerric mulliqueue systems (e.g., Token-passing systems) are known to raise analytically difficult questions in the sense of modelling tractabilty. A prime example is the asymmetric multiqueue system with a single cyclic-server and one-at-a-lime customer service. In the interests of sound approximation techniques. we examine the feasibility of approximation schemes using known results in the...
متن کاملOptimal Topological Arrangement of Queues in Closed Finite Queueing Networks
OPTIMAL TOPOLOGICAL ARRANGEMENTS OF QUEUES IN CLOSED FINITE QUEUEING NETWORKS MAY 2015 LENING WANG M.S.M.E., UNIVERSITY OF MASSACHUSETTS AMHERST Directed by: Professor J. MacGregor Smith Closed queueing networks are widely used in many different kinds of scientific and business applications. Since the demands of saving energy and reducing costs are becoming more and more significant with develo...
متن کامل